Modular andp-adic cyclic codes

Modular and p-adic Cyclic Codes

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo pa and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic cyclic code of length 7 with generator polynomial X 3 + ,~X 2 + (L I)X -l, where )~ satisfies ~2 _ k + 2 = 0. This is the 2-adic generalization of both the bina...

Modular Forms and - adic Representations ∗

the circumstance that L-functions can be introduced not only in the context of automorphic forms, with which he has had some experience, but also in the context of diophantine geometry. That this circumstance can be the source of deep problems was, I believe, first perceived by E. Artin. He was, to be sure, concerned with forms on GL(1) and with varieties of dimension 0. This remains the only c...

Cyclic Codes

MOCK MODULAR FORMS AS p-ADIC MODULAR FORMS

In this paper, we consider the question of correcting mock modular forms in order to obtain p-adic modular forms. In certain cases we show that a mock modular form M is a p-adic modular form. Furthermore, we prove that otherwise the unique correction of M is intimately related to the shadow of M.

Polynomial Codes and Cyclic Codes

As an example, take F2, n = 5 and g(x) = x2 + x + 1. The code consists of the 8 codewords 0 · g(x), . . . , (x2 + x + 1) · g(x). Equivalently, we can identify every polynomial with its vector of coefficients to get a codeword in F2 . Verify that a polynomial code is linear and has dimension k = n −m. Also, check that if g(x) = ∑n−k i=0 gix i is the generator polynomial, then an n× k generating ...